- construct matching
- сравнение конструкций
English-Russian dictionary of computer science. 2015.
construct matching
Смотреть что такое "construct matching" в других словарях:
Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… … Wikipedia
Pattern matching — In computer science, pattern matching is the act of checking some sequence of tokens for the presence of the constituents of some pattern. In contrast to pattern recognition, the match usually has to be exact. The patterns generally have the form … Wikipedia
Conditional (programming) — Conditional statement redirects here. For the general concept in logic, see Material conditional. In computer science, conditional statements, conditional expressions and conditional constructs are features of a programming language which perform … Wikipedia
Regular expression — In computing, a regular expression provides a concise and flexible means for matching (specifying and recognizing) strings of text, such as particular characters, words, or patterns of characters. Abbreviations for regular expression include… … Wikipedia
Otto Julius Zobel — Born October 20, 1887(1887 10 20) Ripon, Wisconsin Died January 1970 (age 82) Morristown, New Jersey … Wikipedia
Control flow — Not to be confused with Flow control. In computer science, control flow (or alternatively, flow of control) refers to the order in which the individual statements, instructions, or function calls of an imperative or a declarative program are… … Wikipedia
Antenna (radio) — Whip antenna on car … Wikipedia
Perl Compatible Regular Expressions — Original author(s) Philip Hazel Stable release 8.20 / 2011 10 21; 25 days ago (2011 10 21) Written in C … Wikipedia
Common Lisp — Paradigm(s) Multi paradigm: procedural, functional, object oriented, meta, reflective, generic Appeared in 1984, 1994 for ANSI Common Lisp Developer ANSI X3J13 committee Typing discipline … Wikipedia
Smith chart — The Smith Chart, invented by Phillip H. Smith (1905 1987), [Smith, P. H.; Transmission Line Calculator; Electronics, Vol. 12, No. 1, pp 29 31, January 1939] [Smith, P. H.; An Improved Transmission Line Calculator; Electronics, Vol. 17, No. 1, p… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
